Well-rounded twists of ideal lattices from imaginary quadratic fields
نویسندگان
چکیده
In this paper, we investigate the properties of well-rounded twists a given ideal lattice an imaginary quadratic field [Formula: see text]. We show that every text] has at least one twist lattice. Moreover, provide explicit algorithm to compute all
منابع مشابه
On Well-rounded Ideal Lattices
We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We consider lattices coming from full rings of integers in number fields, proving that only cyclotomic fields give rise to well-rounded lattices. We further study ...
متن کاملOn Well-rounded Ideal Lattices - Ii
We study well-rounded lattices which come from ideals in quadratic number fields, generalizing some recent results of the first author with K. Petersen [8]. In particular, we give a characterization of ideal well-rounded lattices in the plane and show that a positive proportion of real and imaginary quadratic number fields contains ideals giving rise to well-rounded lattices.
متن کاملON WELL - ROUNDED IDEAL LATTICES 3 Theorem 1
We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We consider lattices coming from full rings of integers in number fields, proving that only cyclotomic fields give rise to well-rounded lattices. We further study ...
متن کاملStability of Ideal Lattices from Quadratic Number Fields
We study semi-stable ideal lattices coming from quadratic number fields. We prove that all ideal lattices of trace type from rings of integers of imaginary quadratic number fields are semi-stable. For real quadratic fields, we demonstrate infinite families of semi-stable and unstable ideal lattices, establishing explicit conditions on the canonical basis of an ideal that ensure stability; in pa...
متن کاملFast ideal cubing in imaginary quadratic number and function fields
We present algorithms for computing the cube of an ideal in an imaginary quadratic number field or function field. In addition to a version that computes a non-reduced output, we present a variation based on Shanks’ NUCOMP algorithm that computes a reduced output and keeps the sizes of the intermediate operands small. Extensive numerical results are included demonstrating that in many cases our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra and Its Applications
سال: 2021
ISSN: ['1793-6829', '0219-4988']
DOI: https://doi.org/10.1142/s021949882250133x